|
==Consensus, synchronisation, and mutual exclusion== Synchronizing concurrent processes. Achieving consensus in a distributed system in the presence of faulty nodes, or in a wait-free manner. Mutual exclusion in concurrent systems. Dijkstra: “Solution of a problem in concurrent programming control” : :This paper presented the first solution to the mutual exclusion problem. Leslie Lamport writes that this work “started the field of concurrent and distributed algorithms”.〔 did not receive the PODC Award or Dijkstra Prize but was nevertheless mentioned twice in the descriptions of the winning papers, in (2002 ) and in (2006 ).〕 Pease, Shostak, Lamport: “Reaching agreement in the presence of faults” Lamport, Shostak, Pease: “The Byzantine generals problem” :. :. :These two papers introduced and studied the problem that is nowadays known as Byzantine fault tolerance. The 1980 paper presented the classical lower bound that agreement is impossible if at least 1/3 of the nodes are faulty; it received the Edsger W. Dijkstra Prize in Distributed Computing in 2005. The highly cited 1982 paper gave the problem its present name, and also presented algorithms for solving the problem. Herlihy, Shavit: “The topological structure of asynchronous computation” Saks, Zaharoglou: “Wait-free ''k''-set agreement is impossible …” :. (Gödel prize lecture ). :. :These two papers study wait-free algorithms for generalizations of the consensus problem, and showed that these problems can be analyzed by using topological properties and arguments. Both papers received the Gödel Prize in 2004. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「List of important publications in concurrent, parallel, and distributed computing」の詳細全文を読む スポンサード リンク
|